Improved Upper Bounds for Self-Avoiding Walks in Zd
نویسندگان
چکیده
New upper bounds for the connective constant of self-avoiding walks in a hypercubic lattice are obtained by automatic generation of finite automata for counting walks with finite memory. The upper bound in dimension two is 2.679192495.
منابع مشابه
Improved lower bounds on the connective constants for self-avoiding walks
We calculate improved lower bounds for the connective constants for selfavoiding walks on the square, hexagonal, triangular, (4.8), and (3.12) lattices. The bound is found by Kesten’s method of irreducible bridges. This involves using transfermatrix techniques to exactly enumerate the number of bridges of a given span to very many steps. Upper bounds are obtained from recent exact enumeration d...
متن کاملImproved lower bounds on the connective constants for two-dimensional self-avoiding walks
We calculate improved lower bounds for the connective constants for selfavoiding walks on the square, hexagonal, triangular, (4.82) and (3.122) lattices. The bound is found by Kesten’s method of irreducible bridges. This involves using transfer-matrix techniques to exactly enumerate the number of bridges of a given span to very many steps. Upper bounds are obtained from recent exact enumeration...
متن کاملNew Upper Bounds for the Connective Constants of Self-avoiding Walks
Using a novel implementation of the Goulden-Jackson method, we compute new upper bounds for the connective constants of self-avoiding walks, breaking Alm's previous records for rectangular (hypercubic) lattices. We also give the explicit generating functions for memory 8. The new upper bounds are 2.
متن کاملNew Lower Bounds on the Self-Avoiding-Walk Connective Constant
We give an elementary new method for obtaining rigorous lower bounds on the connective constant for self-avoiding walks on the hypercubic lattice Zd. The method is based on loop erasure and restoration, and does not require exact enumeration data. Our bounds are best for high d, and in fact agree with the rst four terms of the 1=d expansion for the connective constant. The bounds are the best t...
متن کاملHigh-dimensional graphical networks of self-avoiding walks
We use the lace expansion to analyse networks of mutually-avoiding self-avoiding walks, having the topology of a graph. The networks are defined in terms of spread-out self-avoiding walks that are permitted to take large steps. We study the asymptotic behaviour of networks in the limit of widely separated network branch points, and prove Gaussian behaviour for sufficiently spread-out networks o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 7 شماره
صفحات -
تاریخ انتشار 2000